Extended Truncated Hierarchical Catmull - Clark Subdivision
نویسندگان
چکیده
In this paper we present an extended Truncated Hierarchical Catmull-Clark Subdivision (eTHCCS) method, which improves the efficiency of local refinement in Truncated Hierarchical Catmull-Clark Subdivision (THCCS). We first generalize Stam’s Catmull-Clark basis functions for elements with more than one extraordinary node. In this manner we build a set of basis functions over arbitrary quadrilateral meshes and enable isogeometric analysis on such meshes without any preprocessing. Then, a new basis-function-insertion scheme is developed with the aid of the truncation mechanism, which refines one-ring neighboring elements rather than two-ring neighborhoods. Therefore, eTHCCS significantly improves the efficiency of local refinement compared with THCCS, as demonstrated by one benchmark problem and several complex models. Moreover, eTHCCS is also proved to preserve the input geometry and produce nested spaces.
منابع مشابه
Using Semi-Regular 4-8 Meshes for Subdivision Surfaces
Semi-regular 4–8 meshes are refinable triangulated quadrangulations. They provide a powerful hierarchical structure for multiresolution applications. In this paper, we show how to decompose the DooSabin and Catmull-Clark subdivision schemes using 4–8 refinement. The proposed technique makes it possible to use these classical subdivision surfaces with semi-regular 4–8 meshes. Additional
متن کاملExact Evaluation of Catmull-Clark Subdivision Surfaces Near B-Spline Boundaries
In a seminal paper [5], Jos Stam gave a method for evaluating Catmull-Clark subdivision surfaces [1] at parameter values near an interior extraordinary vertex (EV). The basic idea is to subdivide recursively until the (u, v) parameter to be evaluated is contained in a regular 4×4 grid of control points which define a bicubic B-spline patch. The subdivision steps can be computed very efficiently...
متن کاملApproximate Subdivision Surface Evaluation in the Language of Linear Algebra
We present an interpretation of approximate subdivision surface evaluation in the language of linear algebra. Specifically, vertices in the refined mesh can be computed by left-multiplying the vector of control vertices by a sparse matrix we call the subdivision operator. This interpretation is rather general: it applies to any level of subdivision, it holds for many common subdivision schemes ...
متن کاملGeneralized Catmull-Clark Subdivision
The Catmull-Clark subdivision algorithm consists of an operator that can be decomposed into a refinement operator and a successively executed smoothing operator, where the refinement operator splits each face with m vertices into m quadrilateral subfaces and the smoothing operator replaces each internal vertex with an affine combination of its neighboring vertices and itself. Over regular meshe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015